An improved Evaporation Rate-Water Cycle Algorithm based Genetic Algorithm for solving generalized ratio problems

نویسندگان

چکیده

This paper presents an efficient metaheuristic approach for optimizing the generalized ratio problems such as sum and multiplicative of linear or nonlinear objective function with affine constraints. focuses on significance hybrid techniques, which are implemented by using GA ER-WCA to increase efficiency robustness solving problems. Initially, starts initial random population it is processed genetic operators. will observe preserve GAs fittest chromosome in each cycle every generation. Genetic algorithm provided better optimal solutions while constrained optimization Also, effectiveness proposed analyzed large scale The results performance ensures a strong improves exploitative process when compared other existing techniques. Numerical applications used test convergence accuracy approached method. behavior this those evolutionary algorithms namely Neural Network Algorithm, Grey Wolf Optimization, Evaporation Rate - Water Cycle Firefly algorithm, Cuckoo search algorithm. evaluated show that increases more than algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Water cycle algorithm with evaporation rate for solving constrained and unconstrained optimization problems

This paper presents a modified version of the water cycle algorithm (WCA). The fundamental concepts and ideas which underlie the WCA are inspired based on the observation of water cycle process and how rivers and streams flow to the sea. New concept of evaporation rate for different rivers and streams is defined so called evaporation rate based WCA (ER-WCA), which offers improvement in search. ...

متن کامل

genetic algorithm based on explicit memory for solving dynamic problems

nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...

متن کامل

An improved genetic algorithm for solving simulation optimization problems

Simulation optimization studies the problem of optimizing simulation-based objectives. Simulation optimization is a new and hot topic in the field of system simulation and operational research. To improve the search efficiency, this paper presents a hybrid approach which combined genetic algorithm and local optimization technique for simulation optimization problems. Through the combination of ...

متن کامل

An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems

Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rairo-operations Research

سال: 2021

ISSN: ['1290-3868', '0399-0559']

DOI: https://doi.org/10.1051/ro/2020045